AN OPTIMIZATION-BASED DECOMPOSITION HEURISTIC FOR SOLVING COMPLEX UNDERGROUND MINE SCHEDULING PROBLEMS by
نویسندگان
چکیده
Underground mine production scheduling possesses mathematical structure similar to and yields many of the same challenges as general scheduling problems. That is, binary variables represent the time at which various activities are scheduled. Typical objectives seek to minimize costs or some measure of production time, or to maximize net present value; two principal types of constraints exist: (i) resource constraints, which limit the number of activities committed to a time period based on the availability of a given supply and on the amount of that supply required to perform the activity, and (ii) precedence constraints, which dictate the order in which activities must be completed. In our setting, we maximize “discounted metal production” for the remaining life of an underground lead and zinc mine that uses three different underground methods to extract the ore. Resource constraints limit the grade, tonnage, and backfill paste (used for structural stability) in each time period, while precedence constraints enforce the sequence in which extraction (and backfill) is performed in accordance with the underground mining methods used. We tailor existing exact and heuristic approaches to reduce model size, and develop an optimization-based decomposition heuristic; both of these methods transform a computationally intractable problem to one for which we obtain solutions in seconds, or, at most, hours for problem instances based on data sets from the Lisheen mine near Thurles, Ireland. Our solution adds value to the Lisheen mining operation by: (i) shifting metal production forward in the schedule; (ii) reducing waste mining and backfilling delays; (iii) avoiding expensive mill-halting drops in ore production; and (iv) enabling smoother workforce management. Our modeling approach could be applied to other mines, especially to operations with flat lying deposits that practice retreat, i.e., room-and-pillar, mining, such as coal mines, and to mines that are approaching the end of their operational life.
منابع مشابه
A solution approach for optimizing long- and short-term production scheduling at LKAB's Kiruna mine
We present a mixed-integer program to schedule longand short-term production at LKAB’s Kiruna mine, an underground sublevel caving mine located in northern Sweden. The model minimizes deviations from monthly preplanned production quantities while adhering to operational constraints. Because of the mathematical structure of the model and its moderately large size, instances spanning a time horiz...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملAn imperialist competitive algorithm for solving the production scheduling problem in open pit mine
Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...
متن کاملExtraction and Backfill Scheduling in a Complex Underground Mine
We use mathematical optimization to determine a production schedule (i.e., a schedule of extraction and subsequent filling of the voids) for a complex underground mine in Ireland. The goal of the mining operation is to maximize metal production over the life of the mine, subject to constraints on maximum monthly extraction and backfilling quantities, maximum and minimum monthly metal production...
متن کاملSolving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...
متن کامل